Robust stereo matching based on probabilistic Laplacian propagation with weighted mutual information

نویسندگان

  • Junhyung Kim
  • Seungchul Ryu
  • Seungryong Kim
  • Kwanghoon Sohn
چکیده

Conventional stereo matching methods provide the unsatisfactory results for stereo pairs under uncontrolled environments such as illumination distortions and camera device changes. A majority of efforts to address this problem has devoted to develop robust cost function. However, the stereo matching results by cost function cannot be liberated from a false correspondence when radiometric distortions exist. This paper presents a robust stereo matching approach based on probabilistic Laplacian propagation. In the proposed method, reliable ground control points are selected using weighted mutual information and reliability check. The ground control points are then propagated with probabilistic Laplacian. Since only reliable matching is propagated with the reliability of GCP, the proposed approach is robust to a false initial matching. Experimental results demonstrate the effectiveness of the proposed method in stereo matching for image pairs taken under illumination and exposure distortions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Stereo Matching Using Probabilistic Laplacian Surface Propagation

This paper describes a probabilistic Laplacian surface propagation (PLSP) framework for a robust stereo matching under severe radiometric variations. We discover that a progressive scheme overcomes an inherent limitation for this task, while most conventional efforts have been focusing on designing a robust cost function. We propose the ground control surfaces (GCSs) designed as progressive uni...

متن کامل

Optimizing Disparity Candidates Space in Dense Stereo Matching

In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...

متن کامل

Evaluation of Stereo Matching Costs on Close Range, Aerial and Satellite Images

In the last years, most dense stereo matching methods use evaluation on the Middlebury stereo vision benchmark datasets. Most recent stereo algorithms were designed to perform well on these close range stereo datasets with relatively small baselines and good radiometric behaviour. In this paper, different matching costs on the Semi-Global Matching algorithm are evaluated and compared using the ...

متن کامل

Illumination Invariant Stereo Matching Based on Normalized Mutual Information and Census Methods

Stereo matching aims at finding corresponding pixels from two or more images where distance information is computed by triangulation. Due to different illuminations, intensities are not reliable to be used to search for corresponding pixels. In this paper, we propose a novel local matching method which is capable of dealing with illumination variations between cameras. This new method can disti...

متن کامل

Stereo Matching With Color-Weighted Correlation, Hierarchical Belief Propagation And Occlusion Handling

In this paper, we contrive a stereo matching algorithm with careful handling of disparity, discontinuity and occlusion. This algorithm works a worldwide matching stereo model which is based on minimization of energy. The global energy comprises two terms, firstly the data term and secondly the smoothness term. The data term is approximated by a color-weighted correlation, then refined in obstru...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015